منابع مشابه
Brudno's theorem for Zd (or Zd+) subshifts
We generalize Brudno’s theorem of 1-dimensional shift dynamical system to Z (or Zd+) subshifts. That is to say, in Z d (or Zd+) subshift, the Kolmogorov-Sinai entropy is equivalent to the Kolmogorov complexity density almost everywhere for an ergodic shift-invariant measure. Mathematics Subject Classification (2010). 68Q30, 28Dxx, 37B10, 82B20.
متن کاملOn polynomial approximations over $\mathbb{Z}/2^k\mathbb{Z}$
We study approximation of Boolean functions by low-degree polynomials over the ring Z/2kZ. More precisely, given a Boolean function F : {0, 1}n → {0, 1}, define its k-lift to be Fk : {0, 1}n → {0, 2k−1} by Fk(x) = 2k−F(x) (mod 2k). We consider the fractional agreement (which we refer to as γd,k(F)) of Fk with degree d polynomials from Z/2 Z[x1, . . . , xn]. Our results are the following: • Incr...
متن کاملOn Codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and present construction of formally self-dual codes over $R$. Further, we give bounds on the minimum distance of LCD codes over $\F_q$ and extend these to codes ove...
متن کاملA Two-species Competition Model on Zd
We consider a two-type stochastic competition model on the integer lattice Z. The model describes the space evolution of two “species” competing for territory along their boundaries. Each site of the space may contain only one representative (also referred to as a particle) of either type. The spread mechanism for both species is the same: each particle produces offspring independently of other...
متن کاملOn Quantum Codes Obtained From Cyclic Codes Over $\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$
The aim of this paper is to develop the theory for constructing DNA cyclic codes of odd length over R = Z4[u]/〈u 2 − 1〉. Firstly, we relate DNA pairs with a special 16 element of ring R. Cyclic codes of odd length over R satisfy the reverse constraint and the reverse-complement constraint are discussed in this paper. We also study the GC-content of these codes and their deletion distance. The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2019
ISSN: 1083-6489
DOI: 10.1214/19-ejp400